A taxonomy for task allocation problems with temporal and ordering constraints
نویسندگان
چکیده
Previous work on assigning tasks to robots has proposed extensive categorizations of allocation of tasks with and without constraints. The main contribution of this paper is a more specific categorization of problems that have both temporal and ordering constraints. We propose a novel taxonomy that builds on the existing taxonomy for multi-robot task allocation and organizes the current literature according to the temporal nature of the tasks. We summarize widely used models and methods from the task allocation literature and related areas, such as vehicle routing and scheduling problems, showing similarities and differences.
منابع مشابه
Technical Reports Cover
Previous work on assigning tasks to robots has proposed extensive categorizations of allocation of tasks with and without constraints. The main contribution of this paper is a more specific categorization of problems that have both temporal and ordering constraints. We propose a novel taxonomy that builds on the existing taxonomy for multi-robot task allocation and organizes the current literat...
متن کاملMulti-Robot Allocation of Tasks with Temporal and Ordering Constraints
Task allocation is ubiquitous in computer science and robotics, yet some problems have received limited attention in the computer science and AI community. Specifically, we will focus on multi-robot task allocation problems when tasks have time windows or ordering constraints. We will outline the main lines of research and open problems.
متن کاملA comprehensive taxonomy for multi-robot task allocation
Task allocation is an important aspect of many multi-robot systems. The features and complexity of multi-robot task allocation (MRTA) problems are dictated by the requirements of the particular domain under consideration. These problems can range from those involving instantaneous distribution of simple, independent tasks among members of a homogenous team, to those requiring the time-extended ...
متن کاملA revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers
In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Robotics and Autonomous Systems
دوره 90 شماره
صفحات -
تاریخ انتشار 2017